Characterizing sub-topical functions

Authors

Abstract:

In this paper, we first give a characterization of sub-topical functions with respect to their lower level sets and epigraph. Next, by using two different classes of elementary functions, we present a characterization of sub-topical functions with respect to their polar functions, and investigate the relation between polar functions and support sets of this class of functions. Finally, we obtain more results on the polar of sub-topical functions.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Maximal elements of sub-topical functions with applications to global optimization

We study the support sets of sub-topical functions‎ ‎and investigate their maximal elements in order to establish a necessary and sufficient condition‎ ‎for the global minimum of the difference of two sub-topical functions‎.

full text

maximal elements of sub-topical functions with applications to global optimization

we study the support sets of sub-topical functions‎ ‎and investigate their maximal elements in order to establish a necessary and sufficient condition‎ ‎for the global minimum of the difference of two sub-topical functions‎.

full text

Separation Theorem with Respect to Sub-topical Functions and Abstract Convexity

This paper deals with topical and sub-topical functions in a class of ordered Banach spaces. The separation theorem for downward sets and sub-topical functions is given. It is established some best approximation problems by sub-topical functions and we will characterize sub-topical functions as superimum of elementary sub-topical functions.

full text

Characterizing Open Addressing Hash Functions

In [1], we showed that different open addressing hash functions perform differently when the data elements are not uniformly distributed. So, it is tempting to attribute their difference to some mechanism governing the behavior of the hash functions. In this paper, a simple method of characterizing open addressing hash functions is presented. We showed that, indeed, the nature of data spreading...

full text

Continuity of super- and sub-additive transformations of continuous functions

We prove a continuity inheritance property for super- and sub-additive transformations of non-negative continuous multivariate functions defined on the domain of all non-negative points and vanishing at the origin. As a corollary of this result we obtain that super- and sub-additive transformations of continuous aggregation functions are again continuous aggregation functions.

full text

Characterizing partition functions of the vertex model

Let G denote the collection of all undirected graphs, two of them being the same if they are isomorphic. In this paper, all graphs are finite and may have loops and multiple edges. Let k ∈ N and let F be a commutative ring. Following de la Harpe and Jones [4], call any function y : N → F a (k-color) vertex model (over F).6 The partition function of y is the function fy : G → F defined for any g...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 4  issue 2

pages  13- 23

publication date 2017-12-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023